A multi-robot exploration algorithm based on a static Bluetooth communication chain
نویسندگان
چکیده
In the first part of the present paper, a novel communication scheme of an autonomous robot team via Bluetooth radio is investigated. In the presented solution, an autonomous unit is equipped with two independent Bluetooth radios and so a relatively fast communication is possible in the team in a static (i.e. no ad-hoc) networking topology. The performance of such a network was tested by implementing a linear graph topology by NXT robots. It was found that the reliability and the speed of such a communication scheme are satisfactory and give rise to applications in a robot team control task. In the second part of the paper an area exploration method is presented based on the static linear communication network above. The method was tested by computer simulations for various obstacle configurations and densities. It was found that the proposed method performs better than the chosen reference methods in the case of zero or low obstacle density and when high (75% or 100%) exploration ratio is required. With a simple proof, we have shown that the proposed (fixed chain-like team) exploration method is optimal in the obstacle-free case under the constraint of the connectivity with the base station.
منابع مشابه
Multi Robot Coordination in Area Exploration Based on a Fixed Linear Chain Bluetooth Communication
In the first part of the present paper, a multi-robot system can be highly beneficial for exploration, which is a core robotics task. We know that this exploration task is best performed when using a multi-robot system. We present an algorithm for multi-robot exploration of an unidentified environment, placing into account the communication constraints between the robots. A novel communication ...
متن کاملEffects of Moving Landmark’s Speed on Multi-Robot Simultaneous Localization and Mapping in Dynamic Environments
Even when simultaneous localization and mapping (SLAM) solutions have been broadly developed, the vast majority of them relate to a single robot performing measurements in static environments. Researches show that the performance of SLAM algorithms deteriorates under dynamic environments. In this paper, a multi-robot simultaneous localization and mapping (MR-SLAM) system is implemented within a...
متن کاملMap-merging in Multi-robot Simultaneous Localization and Mapping Process Using Two Heterogeneous Ground Robots
In this article, a fast and reliable map-merging algorithm is proposed to produce a global two dimensional map of an indoor environment in a multi-robot simultaneous localization and mapping (SLAM) process. In SLAM process, to find its way in this environment, a robot should be able to determine its position relative to a map formed from its observations. To solve this complex problem, simultan...
متن کاملFrontier Based Multi Robot Area Exploration Using Prioritized Routing
The paper deals with multi-robot centralized autonomous area exploration of unknown environment with static obstacles. A simple reasoning algorithm based on preassignment of routing priority is proposed. The algorithm tracks the frontiers and assigns the robots to the frontiers when the robots fall into a trap situation. The algorithm is simulated with various multi-robotic configurations in di...
متن کاملFlocking-Based Multi-Robot Exploration
Exploration of an unknown environment is one of the major applications of Multi-Robot Systems. Many works have proposed multi-robot coordination algorithms to accomplish exploration missions based on multi-agent systems techniques. Some of these works particularly focus on multi-robot exploration under communication constraint. In this paper, we propose a solution based on flocking rules in ord...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Robotics and Autonomous Systems
دوره 59 شماره
صفحات -
تاریخ انتشار 2011